Cyclic subgradient extragradient methods for equilibrium problems
نویسندگان
چکیده
منابع مشابه
Some Modified Extragradient Approximation Methods for Variational Inequality Problems and Equilibrium Problems of Nonexpansive Mappings
In this paper, we introduce a modified extragradient approximation method for finding the common element of the set of fixed points of nonexpansive mapping, the set of solutions of an equilibrium problem and the set of solutions of the variational inequality. We show that the sequence converges strongly to a common element of the above three sets under some parameters controlling conditions. Ou...
متن کاملAn alternative extragradient projection method for quasi-equilibrium problems
For the quasi-equilibrium problem where the players' costs and their strategies both depend on the rival's decisions, an alternative extragradient projection method for solving it is designed. Different from the classical extragradient projection method whose generated sequence has the contraction property with respect to the solution set, the newly designed method possesses an expansion proper...
متن کاملSubgradient methods for huge-scale optimization problems
We consider a new class of huge-scale problems, the problems with sparse subgradients. The most important functions of this type are piece-wise linear. For optimization problems with uniform sparsity of corresponding linear operators, we suggest a very efficient implementation of subgradient iterations, which total cost depends logarithmically in the dimension. This technique is based on a recu...
متن کاملSubgradient Methods for Saddle-Point Problems
We consider computing the saddle points of a convex-concave function using subgradient methods. The existing literature on finding saddle points has mainly focused on establishing convergence properties of the generated iterates under some restrictive assumptions. In this paper, we propose a subgradient algorithm for generating approximate saddle points and provide per-iteration convergence rat...
متن کاملPrimal-dual subgradient methods for convex problems
In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arabian Journal of Mathematics
سال: 2016
ISSN: 2193-5343,2193-5351
DOI: 10.1007/s40065-016-0151-3